1528D - It's a bird No it's a plane No it's AaParsa - CodeForces Solution

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <string>
#include <map>
#include <string>
#include <set>
#include <queue>
#include <cmath>
#include <tuple>
#include <stack>
#include <numeric>
#include <climits>
#include <deque>

#define ll long long
#define inf 2147483647
#define inf_long_long 9223372036854775807
#define endl "\n"
#define fastinput ios_base::sync_with_stdio(false); cin.tie(NULL);

using namespace std;

int main() {
    fastinput
    int n, m;
    cin >> n >> m;
    vector<vector<int> > adj(n, vector<int>(n, inf/2));
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a][b] = min(adj[a][b], c);
    }
    for (int i  =0; i < n; i++) {
        vector<int> dijkstra(n, inf/2);
        vector<bool> vis(n, false);
        dijkstra[i] = 0;
        for (int j = 0; j < n; j++) {
            dijkstra[j] = adj[i][j];
        }
        for (int run = 0; run < n; run++) {
            int x = -1;
            for (int j = 0; j < n; j++) {
                if (vis[j]) {
                    continue;
                }
                if (x==-1) {
                    x=j;
                    continue;
                }
                if (dijkstra[j] < dijkstra[x]) {
                    x = j;
                }
            }
            vis[x] = true;
            dijkstra[(x+1)%n] = min(dijkstra[(x+1)%n], dijkstra[x]+1);
            for (int j = 0; j < n; j++) {
                int y = (j+dijkstra[x])%n;
                dijkstra[y] = min(dijkstra[y], dijkstra[x]+adj[x][j]);
            }
        }
        dijkstra[i] = 0;
        for (int j = 0; j < n; j++) {
            cout << dijkstra[j] << " ";
        }
        cout << endl;
    }
}